Incremental Hyperproperty Model Checking via Games
نویسندگان
چکیده
Hyperproperties were proposed as an abstract formalization of security policies, but unfortunately they lack a generic verification methodology. In an attempt to remedy this, we introduced the notion of incremental hyperproperties (IHPs), motivated by the observation that they have a clearer and more feasible verification methodology. To show that verification is indeed feasible, a decidable IHP verification methodology via games is presented and evaluated. The main advantage of the approach is that the games in combination with winning strategy evidence give valuable intuition about the security of a system and are very helpful when analyzing systems w.r.t. policy specifications.
منابع مشابه
Solving Games Using Incremental Induction
Recently, IC3 has been presented as a new algorithm for formal verification. Based on incremental induction, it is often much faster compared to otherwise used fixpoint-based model checking algorithms. In this paper, we use the idea of incremental induction for solving twoplayer concurrent games. While formal verification requires to prove that a given system satisfies a given specification, ga...
متن کاملPuzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers
Paper discuss some issues related to model checking: (1) early model checking teaching via games, (2) utility of model checking and games for solving puzzles, (3) importance of games for validation of model checkers. Basic ideas are illustrated by a model checking based solution for a complicated puzzle how to identify a unique false coin among given ones balancing them limited times.
متن کاملTowards incrementalization of holistic hyperproperties: extended version
A hyperproperty is a set of sets of finite or infinite traces over some fixed alphabet and can be seen as a very generic system specification. In this work, we define the notions of holistic and incremental hyperproperties. Systems specified holistically tend to be more intuitive but difficult to reason about, whereas incremental specifications have a straightforward verification approach. Sinc...
متن کاملReasoning about Games via Temporal Logic: A Model Checking Approach
This article shows how to use a subset of first-order CTL, namely Game Analysis Logic (GAL), in order to reason about games. A model checking algorithm for GAL is presented. Standard games and solution concepts of Game Theory are described in this context. Taking into account the strong relationship between games and Multi-Agent systems(MAS), the approach described here seems to be completely s...
متن کاملTowards Incrementalization of Holistic Hyperproperties
A hyperproperty is a set of sets of finite or infinite traces over some fixed alphabet and can be seen as a very generic system specification. In this work, we define the notions of holistic and incremental hyperproperties. Systems specified holistically tend to be more intuitive but difficult to reason about, whereas incremental specifications have a straightforward verification approach. Sinc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013